Courseware Sequencing Using Heuristic and Local Search

R This paper propases two intelligent agents for learning object automated sequencing using heuristíc and local search. In e-learning iniliatives, sequencing problem concerns arranging a particular se! 01 learning units in a suitable succession for a particular learner. Sequencing ls usualIy perfonned by instructors, who create general and ordered series ra/her than leamer personalized sequences. Eleaming standards are promoted in arder lo ensure interoperability. Campe/enejes are used lo define rela/fans between learning objects within a sequence, so tha! lhe sequencing problem tums into a pennutation problem andAl techniques can be used to solve it. Heuristic and Local Search are two 01 such techniques. An implementation 01 the A* algorithm and Ni!! Climbing algorithm, lor leaming object sequencing, are presented and their peifonnance in a real scenario is discussed.